On-demand route discovery in a unicast manner

While having high bandwidth-efficiency, the ad-hoc on-demand distance vector (AODV) routing protocol suffers from high signaling overhead due to route request (RREQ) messages flooding, especially when the node density and the number of connections are increased. In order to resolve this broadcast storm problem of the AODV in a high node density mobile ad-hoc network, we propose a geographical on-demand route discovery scheme. Assuming a known location of the destination, the RREQ of the proposed routing protocol is propagated in a unicast manner by employing a novel parsing mechanism for possible duplicate RREQs. The routing overhead of the proposed routing protocol is greatly robust to the node density change. We derive the node density required for the proposed routing protocol to keep the same connectivity as the AODV under the circumstance where the nodes are uniformly distributed. In addition, we present an imaginary destination consideration method to incorporate the uncertainty of the destination???s location due to mobility. Computer simulations show that the proposed scheme enables the RREQ propagation to cover 95% of the one-hop communication area centered at the originally known location of the destination without sacrificing the unicast feature

PTA-Sync: Packet-Train-Aided Time Synchronization for Underwater Acoustic Applications

In underwater acoustic applications, time synchronization errors accumulate severely with time, owing to the unpredictable propagation delay change induced by mobility and low sound propagation speed. In previously reported schemes, error accumulation during underwater acoustic time synchronization occurred, decreasing their performance and affecting their applicability. To overcome this limitation, we propose packet-train-aided time synchronization (PTA-Sync) for underwater acoustic application. The proposed PTA-Sync adaptively tracks one-way travel time (OWTT) change using three-dimensional linear velocity vector, the transmit time difference and arrival time difference of two adjacent packets in a packet train, and the position information of a mobile reference node. Thus, this scheme enables us to reduce the synchronization error accumulation rate by estimating the propagation delay change more accurately. Simulation results show PTA-Sync achieves higher accuracy than existing OWTT-based synchronization schemes. Thus, PTA-Sync can be effectively used in underwater exploratory activities because it can successfully reduce time synchronization errors

Modified High-Order PAMs for Binary Coded Physical-Layer Network Coding

The non-binary code (NBC) or the lattice code (LC) has been the only possible channel code with the pulse amplitude modulation (PAM) signaling of modulation size greater than two for the physical layer network coding (PNC) over a decode-and-forward (DF) relaying channel. A major drawback with the NBC or LC however is its high computational complexity. In this letter, we present new modified high-order PAMs that enable us to use the computationally efficient binary channel coding under the PNC over a DF relaying channel.close212

Achievable Sum-Rate of MU-MIMO Cellular Two-Way Relay Channels: Lattice Code-Aided Linear Precoding

We derive a new sum-rate lower bound of the multiuser multi-input multi-output (MU-MIMO) cellular two-way relay channel (cTWRC) which is composed of a base station (BS) and a relay station (RS), both with multiple antennas, and non-cooperative mobile stations (MSs), each with a single antenna. In the first phase, we show that network coding based on decode-and-forward relaying can be generalized to arbitrary input cardinality through proposed lattice code-aided linear precoding, despite the fact that precoding is permitted only at the BS due to non-cooperation among the MSs. In addition, a new sum-rate lower bound for the second phase is derived by showing that the two spatial decoding orders at the BS and MSs for one-sided zero-forcing dirty-paper-coding must be identical. From the fundamental gain of network coding, our sum-rate lower bound achieves the full multiplexing gain regardless of the number of antennas at the BS or RS, and strictly exceeds the previous lower bound which is based on traditional multiuser decoding in the first phase. Furthermore, it is shown that our lower bound asymptotically achieves the sum-rate upper bound in the presence of signal-to-noise ratio (SNR) asymmetry in high SNR regime, and sufficient conditions for this SNR asymmetry are drawn.close71

Asymmetric Propagation Delay-Aware TDMA MAC Protocol for Mobile Underwater Acoustic Sensor Networks

The propagation delay in mobile underwater acoustic sensor network (MUASN) is asymmetric because of its low sound propagation speed, and this asymmetry grows with the increase in packet travel time, which damages the collision avoidance mechanism of the spatial reuse medium access control (MAC) protocols for MUASN. We propose an asymmetric propagation delay-aware time division multiple access (APD-TDMA) for a MUASN in which periodic data packet transmission is required for a sink node (SN). Collisions at the SN are avoided by deferring data packet transmission after reception of a beacon packet from the SN, and data packets are arrived at the SN in a packet-train manner. The time-offset, which is the time for a node to wait before the transmission of a data packet after reception of a beacon packet, is determined by estimating the propagation delay over two consecutive cycles such that the idle interval at the SN is minimized, and this time-offset is announced by the beacon packet. Simulation results demonstrate that the APD-TDMA improves the channel access delay and the channel utilization by approximately 20% and 30%, respectively, compared with those of the block time bounded TDMA under the given network conditions

Codebook-Based Lattice-Reduction-Aided Precoding for Limited-Feedback Coded MIMO Systems

Lattice-reduction-aided precoding (LRP) provides near-capacity rates with the use of low-complexity linear receivers for coded multiple-input multiple-output (MIMO) systems. However, a large amount of feedback in the feedback for an integer or binary precoding matrix has been a bottleneck in its implementation. In this paper, we propose a codebook-based LRP scheme for limited-feedback coded MIMO systems. The proposed LRP scheme follows the fundamentals of the previous LRP scheme that employed multilevel binary coset coding so that the precoding matrix is binary. In the proposed LRP scheme, the conventional precoding matrix obtained from the Lenstra-Lenstra-Lovasz algorithm is modified to specific forms that are predefined in a codebook set. The new precoding matrix is selected such that the lower bound on the capacity is maximized for a given codebook set, while the codebook set is designed offline such that the upper bound of the average capacity loss induced by the limitation on the codebook size is minimized. The simulation results show that the proposed LRP scheme nearly achieves the achievable rate of the conventional LRP scheme with a greatly reduced amount of feedback.close2